Relaying Capability-Based Routing for Improving Service Availability in Multi- hop Cellular Networks

نویسنده

  • Ming-Hua Lin
چکیده

Multi-hop cellular networking models that integrate the characteristics of both cellular and mobile ad hoc networks have received increasing attention. Finding an available relaying path is a critical prerequisite for the success of the multi-hop cellular networks. Most works use signal strength, path length and power consumption as routing criteria to select a relaying path for a mobile node reaching the central base station. Such methods cannot react effectively to the individual impact of each intermediate mobile node contributing to successful hop-by-hop connections. Moreover, forwarding data for others utilizes the resources of the mobile nodes such as battery energy, link bandwidth, buffer space and processing time, the mobile nodes may accept only a limited number of relaying requests. This paper presents a novel routing scheme based on the relaying capability of each mobile node to decrease call blocking probability and handoff call blocking probability, therefore enhancing service availability in the networks. Simulation results indicate that the proposed routing scheme results in higher service availability than the shortest-path routing scheme under a certain constraint on maximum relaying capacity of each mobile node.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Location-based incentive pricing for tree-based relaying in multi-hop cellular networks

Multi-hop cellular networks that integrate the characteristics of both cellular and mobile ad hoc networks have received increasing attention. Providing incentives to foster cooperation among nodes is an important prerequisite for the success of the multi-hop cellular networks. In this paper, we present a location-based incentive pricing scheme to enhance service availability for tree-based rel...

متن کامل

A Dynamic Incentive Pricing Scheme for Relaying Services in Multi-hop Cellular Networks

Applying peer-to-peer communications in cellular networks to improve performance has been an active research area in recent years. Cooperation among nodes is an important prerequisite for the success of the multi-hop cellular networks. Cost savings and service availability are the primary concerns that the network provider adopts multi-hop cellular networking technology. In this paper, we prese...

متن کامل

Improving Energy Consumption by Using Cluster Based Routing Algorithm in Wireless Sensor Networks

Multi-path is favorite alternative for sensor networks, as it provides an easy mechanism to distributetraffic, as well as considerate fault tolerance. In this paper, a new clustering based multi path routingprotocol namely ECRR (Energy efficient Cluster based Routing algorithm for improving Reliability) isproposed, which is a new routing algorithm and guarantees the achievement to required QoS ...

متن کامل

The Feedback Based Mechanism for Video Streaming Over Multipath Ad Hoc Networks

Ad hoc networks are multi-hop wireless networks without a pre-installed infrastructure. Such networks are widely used in military applications and in emergency situations as they permit the establishment of a communication network at very short notice with a very low cost. Video is very sensitive for packet loss and wireless ad-hoc networks are error prone due to node mobility and weak links. H...

متن کامل

Quality-of-service performance bounds in wireless multi-hop relaying networks

The theoretical analysis on quality-of-service (QoS) performances is required to provide the guides for the developments of the next-generation wireless networks. As a good analysis tool, the probabilistic network calculus with moment generating functions (MGFs) recently can be used for delay and backlog performance measures in wireless networks. Different from the existed studies which mostly ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006